Correlation of the two-prime Sidel'nikov sequence
نویسندگان
چکیده
Motivated by the concepts of Sidel’nikov sequences and two-prime generator (or Jacobi sequences) we introduce and analyze some new binary sequences called two-prime Sidel’nikov sequences. In the cases of twin primes and cousin primes equivalent 3 modulo 4 we show that these sequences are balanced. In the general case, besides balancedness we also study the autocorrelation, the correlation measure of order k and the linear complexity profile of these sequences showing that they have many nice pseudorandom features.
منابع مشابه
New construction of M-ary sequence family from Sidel'nikov sequences
In this paper, for a positive integer M and a prime p such that M |pn−1, a family of M -ary sequences using the M ary Sidel’nikov sequences with period pn−1 is constructed. This family has its maximum magnitude of correlation values upper bounded by 3 √ pn + 6 and the family size is (M − 1)2(2n−1 − 1)+M − 1 for p = 2 or (M − 1)(p − 3)/2+M(M − 1)/2 for an odd prime p.
متن کاملLinear Complexity over Fp of Ternary Sidel'nikov Sequences
In this paper, for positive integers m, M , and a prime p such that M |pm − 1, we derive linear complexity over the prime field Fp of M -ary Sidel’nikov sequences of period pm−1 using discrete Fourier transform. As a special case, the linear complexity of the ternary Sidel’nikov sequence is presented. It turns out that the linear complexity of a ternary Sidel’nikov sequence with the symbol k0 =...
متن کاملA Construction of a New Family of M -ary Sequences With Low Correlation From Sidel'nikov Sequences
In this paper, a new family of -ary sequences of period is proposed. The proposed family is constructed by the addition of cyclic shifts of an -ary Sidel’nikov sequence and its reverse sequence. The number of sequences contained in this family is about times of their period and the maximum magnitude of their correlation values is upper bounded by .
متن کاملOn the Relationship of Sidel'nikov Sequences
In this paper, the relationship among -ary Sidel'nikov sequences generated by different primitive elements and decimation are studied. Their autocorrelation function and autocorrelation distribution are derived. It is proved that Sidel'nikov sequences for a given period are equivalent under the decimation, cyclic shift, and scalar multiplication of the sequence. ※ 본 연구는 교육인적자원부, 산업자원부, 노동부의 출...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Des. Codes Cryptography
دوره 59 شماره
صفحات -
تاریخ انتشار 2011